package SkipList;

public class SkipListNode {
    private final double score; // 节点的分数，用于排序
    private Object value; // 存储实际的元素
    SkipListNode[] forward; // 存储不同层的指针
    SkipListNode backward; // 存储前一个节点（用于反向查找）

    public SkipListNode(double score, Object value, int level) {
        this.score = score;
        this.value = value;
        this.forward = new SkipListNode[level];
        this.backward = null;
    }

    public double getScore() {
        return score;
    }

    public Object getValue() {
        return value;
    }

    public void setValue(Object value) {
        this.value = value;
    }
}
